On the Influence of Parameters in Particle Swarm Optimisation Algorithm for Job Shop Scheduling
نویسنده
چکیده
Particle Swarm Optimization (PSO) is one of the latest nature inspired meta-heuristic algorithms based on the metaphor of social interaction and communication such as bird flocking and fish schooling. PSO is a population based algorithm for finding optimal regions of complex search spaces through interaction of individuals in the population. In PSO, a set of randomly generated solutions (initial swarm) navigate in the design space towards the optimal solution over a number of iterations (moves) based on large amount of information about the design space that is assimilated and shared by the members of the swarm. The solution of PSO depend on the parameter setting such as swarm size, number of generations, inertia factor, self confidence factor and swarm confidence factor. This work describes the study on the influence of parameter settings in PSO algorithm in solving the Static Job Shop Scheduling Problem, which is a NP-hard combinatorial problem. Performance of the algorithm is tested on benchmark problems. The influence of each PSO parameter on the performance of algorithm is studied in detail. Key-Words:Combinatorial optimization, nature inspired meta-heuristic, PSO, Scheduling, Job shop, parameter tuning
منابع مشابه
A Particle Swarm Optimization Approach to Joint Location and Scheduling Decisions in A Flexible Job Shop Environment
In traditional scheduling literature, it is generally assumed that the location of facilities are predetermined and fixed in advance. However, these decisions are interrelated and may impact each other significantly. Therefore finding a schedule and facility location has become an important problem as an extension of the well-known scheduling problems. In this research we consider joint decisio...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملTrain Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کاملResearch on Job-shop Scheduling Problem Based on Improved Particle Swarm Optimization
Considering the standard particle swarm optimization (PSO) has the shortcomings of low convergence precision in job shop scheduling problems, the job shop scheduling solution is presented based on improved particle swarm optimization (A-PSO). In this paper, the basic theory of A-PSO is described. Also, the coding and the selection of parameters as well as the decoding of A-PSO are studied. It u...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کامل